31,216 research outputs found

    Predicting the readability of transparent text

    Get PDF
    Will a simple global masking model based on image detection be successful at predicting the readability of transparent text? Text readability was measured for two types of transparent text: additive (as occurs in head-up displays) and multiplicative (which occurs in see-through liquid crystal display virtual reality displays). Text contrast and background texture were manipulated. Data from two previous experiments were also included (one using very low contrasts on plain backgrounds, and the other using higher-contrast opaque text on both plain and textured backgrounds). All variables influenced readability in at least an interactive manner. When there were background textures, the global masking index (that combines text contrast and background root mean square contrast) was a good predictor of search times (r = 0.89). When the masking was adjusted to include the text pixels as well as the background pixels in computations of mean luminance and contrast variability, predictability improved further (r = 0.91)

    Majority-vote model on (3,4,6,4) and (3^4,6) Archimedean lattices

    Full text link
    On Archimedean lattices, the Ising model exhibits spontaneous ordering. Two examples of these lattices of the majority-vote model with noise are considered and studied through extensive Monte Carlo simulations. The order/disorder phase transition is observed in this system. The calculated values of the critical noise parameter are q_c=0.091(2) and q_c=0.134(3) for (3,4,6,4) and (3^4,6) Archimedean lattices, respectively. The critical exponents beta/nu, gamma/nu and 1/nu for this model are 0.103(6), 1.596(54), 0.872(85) for (3,4,6,4) and 0.114(3), 1.632(35), 0.978(104) for (3^4,6) Archimedean lattices. These results differs from the usual Ising model results and the majority-vote model on so-far studied regular lattices or complex networks. The effective dimensionality of the system [D_{eff}(3,4,6,4)=1.802(55) and D_{eff}(3^4,6)=1.860(34)] for these networks are reasonably close to the embedding dimension two.Comment: 6 pages, 7 figures in 12 eps files, RevTex

    Recent Topics on Very High Energy Gamma-ray Astronomy

    Full text link
    With the advent of imaging atmospheric Cherenkov telescopes in late 1980's, ground-based observation of TeV gamma-rays came into reality after struggling trials by pioneers for twenty years, and the number of gamma-ray sources detected at TeV energies has increased to be over seventy now. In this review, recent findings from ground-based very-high-energy gamma-ray observations are summarized (as of 2008 March), and up-to-date problems in this research field are presented.Comment: 6 pages, 4 figures, Proceedings of the International Workshop on Advances in Cosmic Ray Science, March 17-19, 2008, Waseda University, Tokyo, Japan; to be published in Journal of the Physical Society of Japan (supplement

    Comment on "Breakdown of the Internet under Intentional Attack"

    Full text link
    We obtain the exact position of the percolation threshold in intentionally damaged scale-free networks.Comment: 1 page, to appear in Phys. Rev. Let

    Guidance algorithms for a free-flying space robot

    Get PDF
    Robotics is a promising technology for assembly, servicing, and maintenance of platforms in space. Several aspects of planning and guidance for telesupervised and fully autonomous robotic servicers are investigated. Guidance algorithms for proximity operation of a free flyer are described. Numeric trajectory optimization is combined with artificial intelligence based obstacle avoidance. An initial algorithm and the results of its simulating platform servicing scenario are discussed. A second algorithm experiment is then proposed

    Buckets of Water into the Ocean: Non-public Revenue in Public Charter and Traditional Public Schools

    Get PDF
    The funding of K-12 education remains a contentious public policy issue. Questions of funding adequacy and equity across school sectors, school districts and individual schools are prominent in discussions of how to improve educational outcomes, especially for students from disadvantaged backgrounds (Downes & Stiefel 2008; Ladd 2008). Although scholars are divided regarding the extent to which money affects student outcomes in K-12 education (Jackson, Johnson, & Persico 2015; Hanushek, 1997; Burtless 1996), there is basic agreement that more education revenue is better so long as the increased resources are directed towards productive educational activities and programs (Murnane & Levy 1996). If you ask education practitioners, the majority will say that more resources will make their schools better

    Effect of the accelerating growth of communications networks on their structure

    Full text link
    Motivated by data on the evolution of the Internet and World Wide Web we consider scenarios of self-organization of the nonlinearly growing networks into free-scale structures. We find that the accelerating growth of the networks establishes their structure. For the growing networks with preferential linking and increasing density of links, two scenarios are possible. In one of them, the value of the exponent γ\gamma of the connectivity distribution is between 3/2 and 2. In the other, γ>2\gamma>2 and the distribution is necessarily non-stationary.Comment: 4 pages revtex, 3 figure

    Some asymptotic properties of duplication graphs

    Full text link
    Duplication graphs are graphs that grow by duplication of existing vertices, and are important models of biological networks, including protein-protein interaction networks and gene regulatory networks. Three models of graph growth are studied: pure duplication growth, and two two-parameter models in which duplication forms one element of the growth dynamics. A power-law degree distribution is found to emerge in all three models. However, the parameter space of the latter two models is characterized by a range of parameter values for which duplication is the predominant mechanism of graph growth. For parameter values that lie in this ``duplication-dominated'' regime, it is shown that the degree distribution either approaches zero asymptotically, or approaches a non-zero power-law degree distribution very slowly. In either case, the approach to the true asymptotic degree distribution is characterized by a dependence of the scaling exponent on properties of the initial degree distribution. It is therefore conjectured that duplication-dominated, scale-free networks may contain identifiable remnants of their early structure. This feature is inherited from the idealized model of pure duplication growth, for which the exact finite-size degree distribution is found and its asymptotic properties studied.Comment: 19 pages, including 3 figure
    corecore